An Improved E-learner Community Construction Algorithm Based on Learning Interest Feature Vectors

نویسندگان

  • FAN YANG
  • BERND KRAEMER
  • ZHIMEI WANG
  • PENG HAN
چکیده

Finding similar e-learners in a distributed and open elearning environment and help them to learn collaboratively is becoming one of the urgent challenges of personalized e-learning services. Literature shows that current e-learner community building approaches are generated from qualitative studies of small-sized learner-centered classrooms which may need the teacher's participation. However, the findings might not apply to large classes in distributed learning environments, which make the teachers to face hundreds of e-learners in each class. In such situations, teachers also find it impossible to analyze the learning behaviors of each e-learner and divide them into different learning communities accurately. This paper addresses this problem in the adaptive e-learner community self-organizing point of view. Considering both the feature vector of learning resources and a learner's rating value on each resource, this paper firstly defines the learning interest feature vector to model the learner's behavior. Based on this an accurate learning interest feature representation method and, an innovative e-learner community self-organizing algorithm, called IFVSORC, are proposed in this paper. Experimental results show that this algorithm exhibits good community organizing efficiency and scalability. Key-Words: E-Learning, Collaborative Learning, Community Construction, Interest Feature Vector

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem

Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...

متن کامل

Facial expression recognition based on Local Binary Patterns

Classical LBP such as complexity and high dimensions of feature vectors that make it necessary to apply dimension reduction processes. In this paper, we introduce an improved LBP algorithm to solve these problems that utilizes Fast PCA algorithm for reduction of vector dimensions of extracted features. In other words, proffer method (Fast PCA+LBP) is an improved LBP algorithm that is extracted ...

متن کامل

Analysis and Synthesis of Facial Expressions by Feature-Points Tracking and Deformable Model

Face expression recognition is useful for designing new interactive devices offering the possibility of new ways for human to interact with computer systems. In this paper we develop a facial expressions analysis and synthesis system. The analysis part of the system is based on the facial features extracted from facial feature points (FFP) in frontal image sequences. Selected facial feature poi...

متن کامل

Model-Agnostic Private Learning via Stability

We design differentially private learning algorithms that are agnostic to the learning model. Our algorithms are interactive in nature, i.e., instead of outputting a model based on the training data, they provide predictions for a set of m feature vectors that arrive online. We show that, for the feature vectors on which an ensemble of models (trained on random disjoint subsets of a dataset) ma...

متن کامل

A Random Forest Classifier based on Genetic Algorithm for Cardiovascular Diseases Diagnosis (RESEARCH NOTE)

Machine learning-based classification techniques provide support for the decision making process in the field of healthcare, especially in disease diagnosis, prognosis and screening. Healthcare datasets are voluminous in nature and their high dimensionality problem comprises in terms of slower learning rate and higher computational cost. Feature selection is expected to deal with the high dimen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006